Multiobjective solution of the uncapacitated plant location problem
نویسندگان
چکیده
منابع مشابه
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds at the nodes of the tree. The Lagrangean function exploits the structure of the problem and can be decomposed into smaller subproblems which can be solved efficiently. In addition, some reduction procedures based on the...
متن کاملUncapacitated Metric Facility Location Problem (umfl)
• Let L be a set of locations. • Let F ⊂ L be a set of potential facility locations. • Let C ⊂ L be a set of clients (cities). • Let c : L × L → R ∀i, j ∈ L be a distance function. Alternatively think of the function as describing the cost of assigning city j to facility i. • Let f : F → R ∀i ∈ F be a cost function describing the cost of opening a facility at i. • Let φ : C → F ∀j ∈ C be an ass...
متن کاملSolving the uncapacitated facility location problem with semi-Lagrangian relaxation∗
The Semi-Lagrangian Relaxation (SLR) method has been introduced in [BTV06] to solve the p-median problem. In this paper we apply the method to the Uncapacitated Facility Location (UFL) problem. We perform computational experiments on two main collections of UFL problems with unknown optimal values. On one collection, we manage to solve to optimality 16 out of the 18 instances. On the second col...
متن کاملLagrangean Relaxation with Clusters for the Uncapacitated Facility Location Problem
A good strategy for the solution of a large-scale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that connect the clusters of vertices, the conflict graph is divided in subgraphs with the same characteris...
متن کاملAn 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem
The uncapacitated facility location problem in the following formulation is considered: max S⊆I Z(S) = ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2003
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(02)00223-0